Efficient multi-level hp-finite elements in arbitrary dimensions

We present an efficient algorithmic framework for constructing multi-level hp-bases that uses a data-oriented approach easily extends to any number of dimensions and provides natural performance-optimized implementations. only operate on the bounding faces finite elements without considering their lower-dimensional topological features demonstrate potential presented methods using newly written open-source library. First, we analyze Fichera corner show does not increase runtime memory consumption when compared against classical p-version element method. Then, compute transient example with dynamic refinement derefinement, where also obtain expected convergence rates excellent performance in computing time usage.